package com.person.leetcode.editor.cn;

/**
  * 33.搜索旋转排序数组
  * 2022-05-21 10:58:42
**/
public class Sequence_0033_SearchInRotatedSortedArray {
    public static void main(String[] args) {
        Solution solution = new Sequence_0033_SearchInRotatedSortedArray().new Solution();
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
        //o(n)
    public int search(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            if(nums[i] == target)
            {
                return i;
            }
        }
        return -1;
    }
    //对
}
//leetcode submit region end(Prohibit modification and deletion)

}
